Complexity of Path-Following Methods for the Eigenvalue Problem
نویسنده
چکیده
A unitarily invariant projective framework is introduced to analyze the complexity of path–following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill–posedness, is given. A Newton map appropriate for this context is defined, and a version of Smale’s γ-Theorem is proven. The main result of this paper bounds the complexity of path–following methods in terms of the length of the path in the condition metric. To the memory of Jean-Pierre Dedieu and Mario Wschebor
منابع مشابه
A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملContinuation and path following
The main ideas of path following by predictor-corrector and piecewise-linear methods, and their application in the direction of homotopy methods and non-linear eigenvalue problems are reviewed. Further new applications to areas such as polynomial systems of equations, linear eigenvalue problems, interior methods for linear programming, parametric programming and complex bifurcation are surveyed...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملSolving Path Following Problem for Car-Like Robot in the Presence of Sliding Effect via LMI Formulation
One of the main problems of car-like robot is robust path following in the presence of sliding effect. To tackle this problem, a robust mix H2/H∞ static state feedback control method is selected. This method is the well-known linear robust controller which is robust against external disturbance as well as model uncertainty. In this paper, the path following problem is formulated as linear matri...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Foundations of Computational Mathematics
دوره 14 شماره
صفحات -
تاریخ انتشار 2014